COSMICAH 2005: workshop on verification of COncurrent Systems with dynaMIC Allocated Heaps (a Satellite event of ICALP 2005) - Informal Proceedings

Lisboa Portugal, 10 July 200

Who is pointing when to whom: on model-checking pointer structures

This paper introduces a new model to reason about systems composed by entities that can refer to each other via pointers, such as objects in an object-based system. The model, based on History-Dependent Automata, treats particular cases of unboundedness by a special layered mechanism of abstraction. As an application, in this paper the model is used to dene the semantics of a simple language dealing with dynamic allocation and deallocation of entities and pointers. Furthermore, the paper presents a temporal logic that allows to express properties for such systems and that is particularly focussed on the way entities refer to each other. Finally, a sound (but not complete) model checking algorithm for the logic is presented

IC0701 verification competition 2011

Abstract. This paper reports on the experiences with the program verification competition held during the FoVeOOS conference in October 2011. There were 6 teams participating in this competition. We discuss the three different challenges that were posed and the solutions developed by the teams. We conclude with a discussion about the value of such competitions and lessons that can be learned from them.

On Model Checking the Dynamics of Object-Based Software - a Foundational Approach

level #1 Figure 5.5: Commutative diagram for concretion of reallocations

On model checking the dynamics of object-based software : a foundational approach

This dissertation is concerned with software verication, in particular automated techniques to assess the correct functioning of object-based programs. We focus on the dynamic aspects of these programs and consider model-checking based verication techniques. The major obstacle to the design of modelchecking algorithms is the innite state-space explosion caused by the dynamic constructs supported by object-based languages

Memory Leaks Detection in Java by Bi-Abductive Inference

Abstract. This paper describes a compositional analysis algorithm for statically detecting leaks in Java programs. The algorithm is based on separation logic and exploits the concept of bi-abductive inference for identifying the objects which are reachable but no longer used by the program.